Constraint Logic Programming and Mu-Calculus

نویسندگان

  • Serge Colin
  • Fred Mesnard
  • Antoine Rauzy
چکیده

A wide range of problems such as static program analysis and symbolic verii-cation induces the need for an evaluation mechanism of xed point, and thus, a certain form of quantiication over relations. Many specialized tools (MVL 7], MEC 1], .. .) exist, mainly based upon the mu-calculus formalism 9]. On the one hand, while generally ooering good performances, these tools use their own syntaxes, and are restricted to particular applications. On the other hand, Constraint Logic Programming languages are easy to use, give compact source code, provide friendly development platforms with lots of useful libraries, but often suuer from poor performances and lack of features such as second order quantiication and explicit manipulation of relations. The purpose of the work described in this paper is to take the best of the two approaches, more precisely, to integrate a solver of xed point equations, based on the-calculus, into a well known and open Prolog environment : SICStus Prolog. This work originate in the Toupie 10] project. Toupie is a constraint language designed on an extension of-calculus over symbolic nite domain, which provide full universal and existential quantiication and allow the deenition of relations as xed point of equations. We will rst describe the module which has been implemented, then give some results obtained for groundness analysis of logic programs and nally propose promising extensions to this work. 2 The module We chose to implement this solver of xed point equations as a SICStus Prolog module. The SICStus Prolog environment provides a lot of libraries (terms, AVL trees,. ..). Especially, it has a boolean constraints solver 4], coded as a module, and using the ordered binary decision diagram (OBBD) 2, 3] data structure. Techniques of representation of boolean relations and formulas of-calculus using BDDs (and their extensions) have proved to be eecient 6, 10]. It was thus convenient for us to use the BDD primitive of the boolean constraint solver in order to represent our formulas.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spécifications modales de réseaux de Petri

We present an extension of Badouel & Darondeau's results for unlabeled Petri net synthesis from regular languages. We study synthesis from families of languages defined through modal mu-calculus sentence formulas, which translate into modal specifications. A structural restriction makes this problem is decidable.

متن کامل

Inferring and Compiling Termination for Constraint Logic Programs

This paper presents an automated method that deals with termination of constraint logic programs in two steps. First, the method infers a set of potentially terminating classes (using approximation techniques and boolean mu-calculus). By \potentially", we mean that for each of these classes, one can nd a static order over the literals of the clauses of the program to ensure termination. Then, g...

متن کامل

Toward Observational Equivalences for Linear Logic Concurrent Constraint Languages

Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...

متن کامل

Observational equivalences for linear logic concurrent constraint languages

Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...

متن کامل

A Foundation for Higher-order Concurrent Constraint Programming

c Deutsches Forschungszentrum für K ¨ unstliche Intelligenz 1994 This work may not be copied or reproduced in whole of part for any commercial purpose. Permission to copy in whole or part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of the Deutsc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997